翻訳と辞書 Words near each other ・ Vegard Wennesland ・ Vegard's law ・ Vegardbreen ・ Vegardfjella ・ Vegas (band) ・ Vegas (disambiguation) ・ Vegas (duo) ・ Vegas (film) ・ Vegas (pinball) ・ Vegas (song) ・ Vegas (The Crystal Method album) ・ Vegas (TV series) ・ Vegas (Vegas album) ・ Vegas 16 ・ Vegas 96 ・ VEGAS algorithm ・ Vegas Chips ・ Vegas Creek, Nevada ・ Vegas Cubanas ・ Vegas de Matute ・ Vegas del Condado ・ Vegas del Genil ・ Vegas Dream ・ Vegas Girl ・ Vegas Girl (EP) ・ Vegas in Space ・ Vegas Martyrs ・ Vegas National Forest ・ Vegas Oil and Gas ・ Vegas Red Rooster Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク VEGAS algorithm ： ウィキペディア英語版 VEGAS algorithm The VEGAS algorithm, due to G. P. Lepage, is a method for reducing error in Monte Carlo simulations by using a known or approximate probability distribution function to concentrate the search in those areas of the integrand that make the greatest contribution to the final integral. The VEGAS algorithm is based on importance sampling. It samples points from the probability distribution described by the function $|f|$, so that the points are concentrated in the regions that make the largest contribution to the integral. In general, if the Monte Carlo integral of $f$ is sampled with points distributed according to a probability distribution described by the function $g$, we obtain an estimate $E\_g(f;\; N)$, :$E\_g(f;\; N)\; =\; \backslash sum\_i^N\; /\; g(x\_i)$. The variance of the new estimate is then :$\backslash mathit\_g(f;\; N)\; =\; \backslash mathit(f/g;\; N)$ where $\backslash mathit(f;N)$ is the variance of the original estimate, $\backslash mathit(f;\; N)\; =\; E(f^2;\; N)\; -\; (E(f;\; N))^2$. If the probability distribution is chosen as $g\; =\; |f|/I(|f|)$ then it can be shown that the variance $\backslash mathit\_g(f;\; N)$ vanishes, and the error in the estimate will be zero. In practice it is not possible to sample from the exact distribution g for an arbitrary function, so importance sampling algorithms aim to produce efficient approximations to the desired distribution. The VEGAS algorithm approximates the exact distribution by making a number of passes over the integration region while histogramming the function f. Each histogram is used to define a sampling distribution for the next pass. Asymptotically this procedure converges to the desired distribution. In order to avoid the number of histogram bins growing like $K^d$ with dimension ''d'' the probability distribution is approximated by a separable function: $g(x\_1,\; x\_2,\; \backslash ldots)\; =\; g\_1(x\_1)\; g\_2(x\_2)\; \backslash cdots$ so that the number of bins required is only ''Kd''. This is equivalent to locating the peaks of the function from the projections of the integrand onto the coordinate axes. The efficiency of VEGAS depends on the validity of this assumption. It is most efficient when the peaks of the integrand are well-localized. If an integrand can be rewritten in a form which is approximately separable this will increase the efficiency of integration with VEGAS. ==See also== * Las Vegas algorithm * Monte Carlo integration 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「VEGAS algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.